home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / d_array.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  2.5 KB  |  80 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  d_array.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18. //------------------------------------------------------------------------------
  19. // d_array 
  20. //
  21. // Stefan Naeher (1989)
  22. //------------------------------------------------------------------------------ 
  23.  
  24. #ifndef DARRAYH
  25. #define DARRAYH
  26.  
  27. #ifndef RBTREEH 
  28. #include <LEDA/rb_tree.h> 
  29. #endif
  30.  
  31. #define d_array(itype,etype) name3(itype,etype,d_array)
  32.  
  33. #define d_arraydeclare2(itype,etype)\
  34. \
  35. struct d_array(itype,etype) : public rb_tree {\
  36. \
  37. etype init;\
  38. rb_tree_node* iterator;\
  39. \
  40. int  cmp(ent& x, ent& y) const { return compare(*(itype*)&x,*(itype*)&y); }\
  41. void clear_key(ent& x)   const { Clear(*(itype*)&x); }\
  42. void clear_inf(ent& x)   const { Clear(*(etype*)&x); }\
  43. void copy_key(ent& x)    const { Copy(*(itype*)&x);  }\
  44. void copy_inf(ent& x)    const { Copy(*(etype*)&x);  }\
  45. \
  46. etype&  operator[](itype y) { rb_tree_node* i=rb_tree::lookup(Ent(y));\
  47.                               if (i==nil) i=rb_tree::insert(Ent(y),Ent(init));\
  48.                               return *(etype*)&rb_tree::info(i); }\
  49. /*\
  50. etype   operator[](itype y) const\
  51.                             { rb_tree_node* i=rb_tree::lookup(Ent(y));\
  52.                               if (i==nil) return init;\
  53.                               else return etype(rb_tree::info(i)); }\
  54. */\
  55. bool defined(itype y)  const { return (rb_tree::lookup(Ent(y))!=nil); }\
  56. void init_iterator()         { iterator = rb_tree::first_item(); }\
  57. bool next_index(itype& y)    { if (iterator==0) return false;\
  58.                                else { void* p = rb_tree::key(iterator);\
  59.                                       y = *(itype*)&p;\
  60.                                       iterator = rb_tree::next_item(iterator);\
  61.                                       return true; } \
  62.                               }\
  63. \
  64.  d_array(itype,etype)() {};\
  65.  d_array(itype,etype)(etype i) { init=i; }\
  66. \
  67.  d_array(itype,etype)(const d_array(itype,etype)& A) : rb_tree((rb_tree&) A)\
  68.  { init=A.init; }\
  69. \
  70.  d_array(itype,etype)& operator=(const d_array(itype,etype)& A)\
  71.  { rb_tree::operator=((rb_tree&)A); init=A.init; return *this; }\
  72. \
  73. ~d_array(itype,etype)()        { clear(); };\
  74. } ;
  75.  
  76. #define forall_defined(i,A)  for ((A).init_iterator(); (A).next_index(i); )
  77.  
  78.  
  79. #endif
  80.